Colouring Planar Mixed Hypergraphs
نویسندگان
چکیده
منابع مشابه
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a tripleH = (V, C,D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a mapping c : V → [k] such that each C-edge has at least two vertices with a Common colour and each D-edge has at least two vertices of Different colours. H is called a planar mixed hypergraph if its bipartite representation...
متن کاملOn Planar Mixed Hypergraphs
A mixed hypergraph H is a triple (V, C,D) where V is its vertex set and C and D are families of subsets of V , C–edges and D–edges. A mixed hypergraph is a bihypergraph iff C = D. A hypergraph is planar if its bipartite incidence graph is planar. A vertex coloring of H is proper if each C–edge contains two vertices with the same color and each D–edge contains two vertices with different colors....
متن کاملRandomly colouring simple hypergraphs
We study the problem of constructing a (near) random proper q-colouring of a simple k-uniform hypergraph with n vertices and maximum degree ∆. (Proper in that no edge is mono-coloured and simple in that two edges have maximum intersection of size one). We give conditions on q,∆ so that if these conditions are satisfied, Glauber dynamics will converge in O(n log n) time from a random (improper) ...
متن کاملConstrained colouring and σ-hypergraphs
A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours. This notion, introduced by Bujtás and Tuza, generalises both classical hypergraph colourings and more general Voloshin colourings of hypergraphs. In fact, for r-uniform hyperg...
متن کاملProperly 2-Colouring Linear Hypergraphs
Using the symmetric form of the Lovász Local Lemma, one can conclude that a k-uniform hypergraph H admits a proper 2-colouring if the maximum degree (denoted by ∆) of H is at most 2 8k independently of the size of the hypergraph. However, this argument does not give us an algorithm to find a proper 2-colouring of such hypergraphs. We call a hypergraph linear if no two hyperedges have more than ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2000
ISSN: 1077-8926
DOI: 10.37236/1538